Method and processing apparatus for performing arithmetic operation

ABSTRACT

A method of performing an arithmetic operation by a processing apparatus includes determining a polynomial expression approximating an arithmetic operation to be performed on a variable; adaptively determining upper bits for addressing a look-up table (LUT) according to a variable section to which the variable belongs; obtaining coefficients of the polynomial expression from the LUT by addressing the LUT using a value of the upper bits; and performing the arithmetic operation by calculating a result value of the polynomial expression using the coefficients.

CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. application Ser. No. 15/076,084, filed on Mar. 21, 2016 in the U.S. Patent and Trademark Office, which in turn claims the benefit under 35 USC 119(a) of Korean Patent Application No. 10-2015-0132608 filed on Sep. 18, 2015, in the Korean Intellectual Property Office, the contents of both of which are herein incorporated by reference in their entirety.

BACKGROUND 1. Field

This application relates to a processing apparatus for performing an arithmetic operation, and a method of performing an arithmetic operation with the processing apparatus.

2. Description of Related Art

In computing environments, the importance of processors has been gradually increasing. Processors may be used to process images or moving images having a high resolution, and complicated software algorithms, and development of various processor architecture technologies, such as a dual-core processor, a quad-core processor, and multi-threading, is directly connected to development of related technology fields, such as an image processing field and a software engineering field. In computing environments, the processors operate with limited resources. For example, communication bandwidths between the processors and memories are limited due to performance bottlenecks, and energy consumption of the processors is restricted to a certain level or lower. Accordingly, research has been conducted to increase processing performance within the limited resources of the computing environments.

SUMMARY

This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.

In one general aspect, a method of performing an arithmetic operation by a processing apparatus includes determining a polynomial expression approximating an arithmetic operation to be performed on a variable; adaptively determining upper bits for addressing a look-up table (LUT) according to a variable section to which the variable belongs; obtaining coefficients of the polynomial expression from the LUT by addressing the LUT using a value of the upper bits; and performing the arithmetic operation by calculating a result value of the polynomial expression using the coefficients.

The adaptively determining of the upper bits may further include setting each of addresses of the LUT using non-uniform numbers of upper bits.

The determining of the polynomial expression may further include non-uniformly splitting variables that can be input to the arithmetic operation into variable sections; and the adaptively determining of the upper bits may further include setting addresses of the LUT using numbers of upper bits, the numbers of upper bits respectively corresponding to sizes of the variable sections.

A degree of non-uniformity of the variable sections may be based on an error between the polynomial expression and the arithmetic operation.

The setting of the addresses of the LUT may further include setting the addresses of the LUT using a larger number of upper bits for a variable section in which the error is large, and a smaller number of upper bits for a variable section in which the error is small.

The degree of non-uniformity of the variable sections may depend on a type of the arithmetic operation; and the numbers of upper bits used to set the addresses of the LUT may depend on the type of the arithmetic operation.

The adaptively determining of the upper bits may further include determining a number of the upper bits based on a size of the variable section to which the variable belongs.

The variable may have n bits, and the upper bits may be m upper bits of the n bits, wherein n and m are natural numbers; an input variable of the polynomial expression may be a value of (n−m) lower bits of the variable; and the performing of the arithmetic operation may further include performing the arithmetic operation by calculating the result value of the polynomial expression using the input variable and the coefficients.

The arithmetic operation may be an arithmetic operation for evaluating an elementary function including any one or any combination of any two or more of a square root function, an inverse square root function, a reciprocal function, a log function, an exponential function, a power series function, and a trigonometric function.

The determining of the polynomial expression may further include non-uniformly splitting variables that can be input to the arithmetic operation into variable sections; and the adaptively determining of the upper bits may further include setting addresses of the LUT to respectively correspond to the variable sections using the upper bits.

The polynomial expression may be a k-th order polynomial expression having (k+1) coefficients; and the (k+1) coefficients may be mapped to each of addresses of the LUT.

In another general aspect, a non-transitory computer-readable storage medium stores instructions for causing computing hardware to perform the method described above.

In another general aspect, a processing apparatus for performing an arithmetic operation includes a polynomial expression converter configured to determine a polynomial expression approximating an arithmetic operation to be performed on a variable; an addressing unit configured to adaptively determine upper bits for addressing a look-up table (LUT) according to a variable section to which the variable belongs; an obtainer configured to obtain coefficients of the polynomial expression from the LUT by addressing the LUT using a value of the upper bits; and a calculator configured to perform the arithmetic operation by calculating a result value of the polynomial expression using the coefficients.

The addressing unit may be further configured to set each of addresses of the LUT using non-uniform numbers of upper bits.

The polynomial expression converter may be further configured to non-uniformly split variables that can be input to the arithmetic operation into variable sections; and the addressing unit may be further configured to set addresses of the LUT using numbers of upper bits, the numbers of upper bits respectively corresponding to sizes of the variable sections.

A non-uniformity degree of the variable sections may be based on an error between the polynomial expression and the arithmetic operation; and the addressing unit may be further configured to set the addresses of the LUT using a larger number of upper bits for a variable section in which the error is large, and a smaller number of upper bits for a variable section in which the error is small.

The degree of non-uniformity of the variable sections may depend on a type of the arithmetic operation; and the numbers of upper bits used to set the addresses of the LUT may depend on the type of the arithmetic operation.

The addressing unit may be further configured to determine a number of the upper bits based on a size of the variable section to which the variable belongs.

The variable may have n bits, and the upper bits may be m upper bits of the n bits, wherein n and m are natural numbers; an input variable of the polynomial expression may be a value of (n−m) lower bits of the variable; and the calculator may be further configured to perform the arithmetic operation by calculating the result value of the polynomial expression using the input variable and the coefficients.

The polynomial expression converter may be further configured to non-uniformly split variables that can be input to the arithmetic operation into variable sections; and the addressing unit may be further configured to set addresses of the LUT to respectively correspond to the variable sections using the upper bits.

In another general aspect, a processing apparatus for performing an arithmetic operation includes a polynomial expression converter configured to determine a polynomial expression approximating an arithmetic operation to be performed on a variable; an addressing unit configured to determine a partial address of a look-up table (LUT) configured to store coefficients of the polynomial expression, the partial address identifying a section of the LUT corresponding to a range of variables including the variable on which the arithmetic operation is to be performed; an obtainer configured to obtain coefficients of the polynomial expression from the LUT by addressing the LUT using the partial address; and a calculator configured to perform the arithmetic operation on the variable by evaluating the polynomial expression using the coefficients obtained from the LUT.

The variable on which the arithmetic operation is to be performed may have n bits, and the partial address may be m upper bits of the n bits, wherein n and m are natural numbers; an input variable of the polynomial expression may be (n−m) lower bits of the variable on which the arithmetic operation is to be performed; and the calculator may be further configured to perform the arithmetic operation on the variable by evaluating the polynomial expression using the coefficients obtained from the LUT and the input variable.

The polynomial expression converter may be further configured to determine a plurality of polynomial expressions each approximating the arithmetic operation for a different range of variables; the addressing unit may be further configured to determine a plurality of partial addresses of the LUT each identifying a different section of the LUT storing coefficients of a different one of the polynomial expressions; the obtainer may be further configured to obtain coefficients of one of the polynomial expressions corresponding to a range of variables including the variable on which the arithmetic operation is to be performed by addressing the LUT using the partial address identifying the section of the LUT storing the coefficients of the one polynomial expression; and the calculator may be further configured to perform the arithmetic operation on the variable by evaluating the one polynomial expression using the coefficients obtained from the LUT.

The polynomial expression converter may be further configured to divide an entire range of variables on which the arithmetic operation can be performed into a plurality of different ranges of variables, at least two of the different ranges having different sizes, and determine a plurality of polynomial expressions each approximating the arithmetic operation for a different one of the different ranges of variables.

Each partial address of the partial addresses may have a number of bits that depends on a size of one of the different ranges of variables corresponding to one of the polynomial expressions having the coefficients stored in the section of the LUT identified by the partial address.

Other features and aspects will be apparent from the following detailed description, the drawings, and the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an example of a computing system.

FIG. 2 is a diagram for describing an example of approximating an elementary function using a polynomial expression.

FIG. 3A is a diagram for describing an example of approximating an arithmetic operation for evaluating an elementary function f(x).

FIG. 3B is a diagram for describing an example of a processing apparatus for performing the arithmetic operation of FIG. 3A.

FIG. 4A is a diagram for describing another example of approximating an arithmetic operation for evaluating an elementary function f(x).

FIG. 4B is a diagram for describing another example of a processing apparatus for performing the arithmetic operation of FIG. 4A.

FIG. 5 is a diagram for describing an example of a case in which sizes of variable sections are the same.

FIG. 6 is a block diagram of an example of a detailed hardware structure of a processing apparatus.

FIG. 7 illustrates an example of a look-up table (LUT).

FIG. 8 is a diagram for describing examples of relationships between variable sections, numbers of upper bits, and addresses.

FIG. 9 is a diagram for describing examples of relationships between numbers of upper bits and variable sections.

FIG. 10 is a diagram for describing an example of a process performed by a processing apparatus of evaluating a polynomial expression obtained by approximating an arithmetic operation using an LUT.

FIG. 11 is a diagram for describing examples of values to be input to a second-order polynomial expression obtained from a 10-bit variable X.

FIG. 12 illustrates another example of an LUT.

FIG. 13 is a diagram for describing another example of a process performed by a processing apparatus of evaluating a polynomial expression obtained by approximating an arithmetic operation using an LUT.

FIG. 14 is a diagram for describing examples of methods of determining a number of upper bits for setting addresses of an LUT.

FIG. 15 is a diagram for describing an example of a case in which addresses of an LUT are set using a fixed number of upper bits.

FIG. 16 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function log₂(x).

FIG. 17 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function 1/x.

FIG. 18 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function √{square root over (x)}.

FIG. 19 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function 1/√{square root over (x)}.

FIG. 20 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function e^(x).

FIG. 21 is a diagram for describing an example of a method of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function sin(x).

FIG. 22 is a flowchart of an example of a method of performing an arithmetic operation performed by a processing apparatus.

Throughout the drawings and the detailed description, the same reference numerals refer to the same elements. The drawings may not be to scale, and the relative size, proportions, and depiction of elements in the drawings may be exaggerated for clarity, illustration, and convenience.

DETAILED DESCRIPTION

The following detailed description is provided to assist the reader in gaining a comprehensive understanding of the methods, apparatuses, and/or systems described herein. However, various changes, modifications, and equivalents of the methods, apparatuses, and/or systems described herein will be apparent to one of ordinary skill in the art. The sequences of operations described herein are merely examples, and are not limited to those set forth herein, but may be changed as will be apparent to one of ordinary skill in the art, with the exception of operations necessarily occurring in a certain order. Also, descriptions of functions and constructions that are well known to one of ordinary skill in the art may be omitted for increased clarity and conciseness.

The features described herein may be embodied in different forms, and are not to be construed as being limited to the examples described herein. Rather, the examples described herein have been provided so that this disclosure will be thorough and complete, and will convey the full scope of the disclosure to one of ordinary skill in the art.

All terms, including descriptive or technical terms, that are used herein are to be construed as having the meanings that they have to one of ordinary skill in the art. However, the terms may have different meanings according to the intention of one of ordinary skill in the art, legal precedence, or the appearance of new technologies. Also, some terms may be arbitrarily selected by the applicant, and in this case, the meaning of these terms will be described in detail in the detailed description. Thus, the terms used herein are to be interpreted based on the meaning of the terms together with the description throughout the specification.

Also, the terms “includes” and “comprises” used herein are not to be construed as necessarily including all of the elements or operations stated, and some elements or operations may not be included or additional elements or operations may be further included.

FIG. 1 is a block diagram of an example of a computing system 1.

Referring to FIG. 1, the computing system 1 includes a central processing unit (CPU) 11, a graphics processing unit (GPU) 12, and a memory device 20. The CPU 10 and the GPU 12 are processing apparatuses, and the processing apparatuses may be other types of processors besides the CPU 11 and the GPU 12. FIG. 1 illustrates only components of the computing system 1 related to one or more examples described below, but it will be apparent to one of ordinary skill in the art that the computing system 1 may also include other general-purpose components in addition to the components shown in FIG. 1.

Examples of the computing system 1 include a desktop computer, a laptop computer, a smart phone, a personal digital assistant (PDA), a portable media player, a video game console, a television set-top box, a tablet device, an e-book reader, and a wearable device, but are not limited thereto. In other words, various apparatuses may be included in a category of the computing system 1.

Processing apparatuses, such as the CPU 11 and the GPU 12, are hardware that performs various operations. The CPU 11 operates as hardware that controls overall functions of the computing system 1, and controls the remaining components, i.e., the GPU 12 and the memory device 20. The CPU 11 performs various types of operations for controlling functions of the computing system 1. The GPU 12 operates as hardware that controls a graphics processing function of the computing system 1. In other words, the GPU 12 executes various types of graphics pipelines, such as an open graphics library (OpenGL), DirectX, and a compute unified device architecture (CUDA), while performing operations related to the graphics pipelines, such as a shading operation.

The memory device 20 may be a random-access memory (RAM), such as a dynamic random-access memory (DRAM) or a static random-access memory (SRAM), or may be a read-only memory (ROM) or an electrically erasable programmable read-only memory (EEPROM). In other words, the memory device 20 may store data that has finished being processed by the CPU 11 or the GPU 12 (for example, results of arithmetic operations), or may provide data to be executed by the CPU 11 or the GPU 12 (for example, source code).

In this example, the memory device 20 stores a look-up table (LUT) 200 that can be accessed by the processing apparatuses, such as the CPU 11 and the GPU 12. The CPU 11 or the GPU 12 may access the LUT 200 to obtain data required to perform an arithmetic operation. The LUT 200 may be a table in which numerical data is mapped to each address.

Examples of the arithmetic operation include a square root operation, an inverse square root operation, a reciprocal operation, a log operation, an exponential operation, a power series operation, and a trigonometric operation, but are not limited thereto. The square root function, the inverse square root function, the reciprocal function, the log function, the exponential function, the power series function, and the trigonometric function are elementary functions, and the CPU 11 or the GPU 12 performs arithmetic operations for function control or a graphics process of the computing system 1 by evaluating such elementary functions.

For example, when the CPU 11 or the GPU 12 perform a certain type of arithmetic operation, the CPU 11 or the GPU 12 obtains certain numerical data mapped to a certain address by referring to the LUT 200, and quickly processes the certain type of arithmetic operation using the certain numerical data.

FIG. 2 is a diagram for describing an example of approximating an elementary function using a polynomial expression.

In terms of performance, power, and area (PPA), it may not be efficient if circuits (hardware logic) for directly evaluating elementary functions, such as a square root operation, an inverse square root operation, a reciprocal operation, a log operation, an exponential operation, a power series operation, and a trigonometric operation, are provided inside a processing apparatus. Also, even if such elementary functions can be processed at a software level, PPA may also not be efficient since instructions are invoked in source code and many branch statements are included in the source code. Accordingly, such elementary functions may be approximated by polynomial expressions, and the polynomial expressions may be evaluated to increase a processing performance of a processing apparatus.

Referring to FIG. 2, a target elementary function 201, i.e., Y=f(x), is approximated by a k-th order polynomial expression, wherein k denotes a natural number. For example, the target elementary function 201 is approximated by a second-order polynomial expression 202, i.e., aX′²+bX′+c. An error 205 exists because the target elementary function 201 is approximated by the second-order polynomial expression 202. Accordingly, by reducing the error 205, an accurate result of evaluating the target elementary function 201 may be obtained.

FIG. 3A is a diagram for describing an example of approximating an arithmetic operation for evaluating an elementary function 301, i.e., f(x).

Referring to FIG. 3A, an arithmetic operation for evaluating the elementary function 301 is approximated by a plurality of different second-order polynomial expressions 303 through 306. In detail, the elementary function 301 (i.e., the arithmetic operation) has a variable X, and the variable X is split into variable sections {circle around (1)}, {circle around (2)}, {circle around (3)}, and {circle around (4)}. In the variable section {circle around (1)}, the elementary function 301 is approximated by the second-order polynomial expression 303, i.e., a₁X′²+b₁X′+c₁ in the variable section {circle around (2)}, the elementary function 301 is approximated by the second-order polynomial expression 304, i.e., a₂X′²+b₂X′+c₂, in the variable section {circle around (3)}, the elementary function 301 is approximated by the second-order polynomial expression 305, i.e., a₁X′²+b₁X′+c₁, and in the variable section {circle around (2)}, the elementary function 301 is approximated by the second-order polynomial expression 306, i.e., a₄X′²+b₄X′+c₄. A variable X′ is a variable derived from the variable X by excluding upper bits of the variable X as will be explained below, and is input to evaluate the second-order polynomial expressions 303 through 306.

In this example, the term “variable section” denotes a section obtained by splitting a range of variables that can be input to an arithmetic operation, and sizes of the variable sections are non-uniform. As shown in FIG. 3A, sizes of the variable sections {circle around (1)}, {circle around (2)}, {circle around (3)}, and {circle around (4)} are not uniform. The sizes of the variable sections {circle around (1)}, {circle around (2)}, {circle around (3)}, and {circle around (4)} are based on errors between the arithmetic operation and the second-order polynomial expressions 303 through 306, and a size of a variable section is small when an error is large, and is large when an error is small.

FIG. 3B is a diagram for describing an example of a processing apparatus for performing the arithmetic operation of FIG. 3A.

Referring to FIG. 3A, coefficients a₁ through c₄ of the second-order polynomial expressions 303 through 306 are stored in an LUT 310. The processing apparatus obtains, from the LUT 310, coefficients corresponding to variables X₁, X₂, X₃, and so on of the elementary function 301 by accessing the LUT 310, and evaluates the second-order polynomial expressions 303 through 306 using the obtained coefficients, thereby performing the arithmetic operation of the elementary function 301.

The processing apparatus addresses the LUT 310 using addresses corresponding to a variable. For example, when the variable X₁ belongs to the variable section {circle around (1)}, the processing apparatus obtains the coefficients a₁, b₁, and c₁ by addressing the LUT 310 using an address Addr. i corresponding to the variable section {circle around (1)}. Also, when the variable X₂ corresponds to the variable section {circle around (2)}, the processing apparatus obtains the coefficients a₃, b₂, and c₂ by addressing the LUT 310 using an address Addr. i+1 corresponding to the variable section {circle around (2)}.

FIG. 4A is a diagram for describing another example of approximating an arithmetic operation for evaluating an elementary function 401, i.e., f(x). FIG. 4B is a diagram for describing another example of a processing apparatus for performing the arithmetic operation of FIG. 4A.

Referring to FIG. 4A, an arithmetic operation for evaluating the elementary function 401 is approximated by a plurality of third-order polynomial expressions 403 through 406. The elementary function 401 (i.e., the arithmetic operation) has a variable X, and the variable X is split into variable sections {circle around (a)}, {circle around (b)}, {circle around (c)}, and {circle around (d)}. As described above, sizes of the variable sections {circle around (a)}, {circle around (b)}, {circle around (c)}, and {circle around (d)} are non-uniform. The sizes of the variable sections {circle around (a)}, {circle around (b)}, {circle around (c)}, and {circle around (d)} are based on errors between the arithmetic operation and the third-order polynomial expressions 403 through 406, and a size of a variable section is small when an error is large, and is large when an error is small.

Referring to FIG. 48, the processing apparatus obtains, from an LUT 410, coefficients corresponding to variables X₁, X₂, X₃, and so on of the elementary function 401 by accessing the LUT 410, and evaluates the third-order polynomial expressions 403 through 406 using the obtained coefficients, thereby performing the arithmetic operation of the elementary function 401.

In other words, referring to FIGS. 3A through 48, an arithmetic operation approximated by a polynomial expression may be performed by a processing apparatus in a similar manner regardless of an order of the polynomial expression.

FIG. 5 is a diagram for describing an example of a case in which sizes of variable sections are the same.

Referring to FIG. 5, unlike the examples described above with reference to FIGS. 3A and 4A, the sizes of the variable sections in FIG. 5 are the same. In graphs of the types of elementary functions described above, a curve section and a convergent section converging to a certain value exist. When the curve section and the convergent section have the same size, an error between an elementary function and a polynomial expression approximating the elementary function in the curve section is larger than an error between the elementary function and the polynomial expression approximating the elementary function in the convergent section. Accordingly, when the sizes of the variable sections are the same, it is difficult to obtain an accurate result of an arithmetic operation due to the large error in the curve section. However, in the examples described in this application sizes of variable sections are non-uniform in consideration of errors between an elementary function and polynomial expressions approximating the elementary function.

FIG. 6 is a block diagram of an example of a detailed hardware structure of a processing apparatus 10.

Referring to FIG. 6, the processing apparatus 10 includes a polynomial expression converter 110, an addressing unit 120, an obtainer 130, and a calculator 140. FIG. 6 illustrates only components of the processing apparatus 10 related to one or more examples described below, but it will be apparent to one of ordinary skill in the art that the processing apparatus 10 may also include general-purpose components in addition to the components shown in FIG. 6.

The processing apparatus 10 may be the CPU 11 of FIG. 1, the GPU 12 of FIG. 1, another type of processor, or a combination thereof.

The polynomial expression converter 110 determines a polynomial expression that approximates an arithmetic operation to be performed on a variable. The polynomial expression converter 110 determines an order of the polynomial expression approximating the arithmetic operation. In examples described below, the arithmetic operation is approximated by a second or third-order polynomial expression for convenience of description, but the examples are not limited thereto.

The addressing unit 120 adaptively determines upper bits for addressing an LUT (for example, the LUT 200 of FIG. 1) stored in the memory device 20 according to a variable section to which the variable belongs. For example, when the variable is n bits (where n is a natural number), the addressing unit 120 determines m upper bits (where m is a natural number) of the n bits according to a variable section to which the n bits belong. The meaning of adaptively determining the upper bits is that the number of upper bits determined according to the variable section may adaptively vary. Accordingly, the term “adaptively” may be replaced by “dynamically”.

The addressing unit 120 determines the number of upper bits according to a size of the variable section to which the variable belongs. For example, when the variable section has a large size, the addressing unit 120 determines a low number of upper bits, and when the variable section has a small size, the addressing unit 120 determines a high number of upper bits.

The addressing unit 120 determines the upper bits to address the LUT. In other words, the addressing unit 120 addresses the LUT using the determined upper bits.

The LUT will now be described. Addresses of the LUT respectively correspond to variable sections, and are set using a non-uniform number of upper bits. In other words, the addresses of the LUT are set by respectively using numbers of upper bits corresponding to sizes of variable sections obtained by the polynomial expression converter 110 non-uniformly splitting variables that can be input to an arithmetic operation into the variable sections. A non-uniformity degree of variable sections is based on an error between an arithmetic operation and polynomial expressions approximating the arithmetic operation as described above with reference to FIGS. 3A and 4A. The addresses of the LUT are set using a larger number of upper bits when an error is large, and a smaller number of upper bits when an error is small.

When the polynomial expression is a k-th order polynomial expression, (k+1) coefficients of the k-th order polynomial expression are mapped to each of the addresses of the LUT. For example, three coefficients are mapped to one address of an LUT for a second-order polynomial expression, and four coefficients are mapped to one address of an LUT for a third-order polynomial expression. In FIG. 1, one LUT is stored in the memory device 20, but the memory device 20 may store different LUTS according to types of arithmetic operations and orders of polynomial expressions approximating the arithmetic operations.

A non-uniformity degree of variable sections is changeable according to types of arithmetic operations, for example, based on whether an arithmetic operation is a log operation, a square root operation, etc. Accordingly, a number of upper bits used as addresses of an LUT is changeable according to types of arithmetic operations.

How the addressing unit 120 determines the number of upper bits using the LUT will be described in detail below.

The obtainer 130 obtains coefficients of the polynomial expression from the LUT by addressing the LUT using a value of the upper bits that are adaptively determined. For example, referring to FIGS. 3A and 3B, when the polynomial expressions determined by the polynomial expression converter 110 are second-order polynomial expressions 303 through 306, the obtainer 130 obtains the coefficients a₁ through c₄ of the second-order polynomial expressions 303 through 306 from the LUT 310.

The calculator 140 calculates a result value of the polynomial expression using the coefficients, thereby performing the arithmetic operation. In other words, the result value of the polynomial expression is considered a result of performing the arithmetic operation. As described above, when the variable has n bits and the upper bits are m bits of the n bits, an input variable X′ of the polynomial expression has a value of (n−m) lower bits of the variable. The calculator 140 performs the arithmetic operation by calculating the result value of the polynomial expression using the input variable X′ and the coefficients.

The LUT is pre-stored in the memory device 20. As described above, the memory device 20 may store various LUTs according to types of arithmetic operations or according to orders of polynomial expressions. In the LUT stored in the memory device 20, a number of upper bits to be used as addresses and values of coefficients are changeable according to usage environments of the computing system 1. In other words, data in an LUT may be changed by a user, and a structure of the LUT is not limited. However, addresses of the LUT are set so that the number of upper bits is not uniform.

FIG. 7 illustrates an example of an LUT 701.

Referring to FIG. 7, the LUT 701 includes an address item and a coefficient item. For example, when the LUT 701 is for a second-order polynomial expression, three coefficients of the second-order polynomial expression are mapped to one address of the LUT 701. For example, when the addressing unit 120 of the processing apparatus 10 requests data at an address Addr. i, the obtainer 130 obtains coefficients a₁, b₁, and c₁ from the LUT 701. However, the LUT 701 of FIG. 7 is only an example, and a structure of the LUT 701 may vary. Accordingly, an LUT in the examples described in this application is not limited to the LUT 701 of FIG. 7.

FIG. 8 is a diagram for describing examples of relationships between variable sections, numbers of upper bits, and addresses.

Referring to FIG. 8, an arithmetic operation is an elementary function log₂(x). Variables that can be input to the elementary function log₂(x) are split into variable sections 801 through 803 having non-uniform sizes. As described above, in the elementary function log₂(x), the variables are split into the variable section 801 corresponding to a steep curve section, the variable section 802 corresponding to a gentle curve section, and the variable section 803 corresponding to a convergent section. Sections in FIG. 8 other than the variable sections 801 through 803 are not described for convenience of description.

Sizes of the variable sections 801 through 803 are defined based on the elementary function log₂(x) and polynomial expressions to be used to approximate the elementary function log₂(x). For example, when the variable sections 801 and 802 are approximated by one polynomial expression, an error is large compared to the variable section 803. Accordingly, the variable sections 801 and 802 are approximated by two polynomial expressions to reduce an error. The variable section 801 is smaller than the variable section 802 to further reduce an error. Accordingly, variables between a variable 2^(−n-4) and a variable 2^(−n-1) are split into the variable sections 801 through 803 having non-uniform sizes.

Since the sizes of the variable sections 801 through 803 are not uniform, numbers of variables included in the variable sections 801 through 803 are also different from each other. Accordingly, when a size of a variable section is large, a number of upper bits to be used as an address is small, and when a size of a variable section is small, a number of upper bits to be used as an address is large. In other words, it may be concluded from the non-uniform sizes of the variable sections 801 through 803 that the numbers of upper bits to be used as addresses are non-uniform. For example, referring to a candidate variable list 810, upper bits corresponding to the variable section 801 are “000001”, upper bits corresponding to the variable section 802 are “00001”, and upper bits corresponding to the variable section 803 are “0001”.

According to LUT addressing 820 of the elementary function log₂(x), when 2^(−n-4)≤X<2^(−n-3), the variable X belongs to the variable section 801 and addressing is performed to an address Addr. i corresponding to the upper bits “000001”, when 2^(−n-3)≤X<2^(−n-2), the variable X belongs to the variable section 802 and addressing is performed to an address Addr. i+1 corresponding to the upper bits “00001”, and when 2^(−n-2)≤X<2^(−n-1), the variable X belongs to the variable section 803 and addressing is performed to an address Addr. i+2 corresponding to the upper bits “0001”.

In relation to FIG. 6, when it is determined that the variable X having 10 bits belongs to the variable section 801, the addressing unit 120 determines six upper bits “000001” of the variable X based on the candidate variable list 810. Then, the obtainer 130 determines that an address corresponding to the upper bits “000001” is Addr. i, and addresses an LUT using the address Addr. i, thereby obtaining coefficients of a polynomial expression approximating the elementary function log₂(x) in the variable section 801.

FIG. 9 is a diagram for describing examples of relationships between numbers of upper bits and variable sections.

As described above, when a size of a variable section increases, a number of upper bits is decreased. On the other hand, when a size of a variable section decreases, a number of upper bits is increased.

Referring to FIG. 9, variables belonging to a variable section 901 have three upper bits “010” and are addressed to an address Addr. i′, and variables belonging to a variable section 902 have five upper bits “11110” and are addressed to an address Addr. i″. 10-bit variables from “0100000000” to “0101111111” belong to the variable section 901, and 10-bit variables from “1111000000” to “1111011111” belong to the variable section 902. In other words, since more variables belong to the variable section 901 than to the variable section 902, a size of the variable section 901 is larger than a size of the variable section 902.

As such, by setting addresses of an LUT using non-uniform numbers of upper bits, the addresses correspond to variable sections having various sizes. A non-uniformity degree of variable sections is based on an error between an arithmetic operation and polynomial expressions approximating the arithmetic operation in the variable sections, and is a factor arbitrarily defined by a user who wants to generate an LUT according to types of arithmetic operations and orders of polynomial expressions.

FIG. 10 is a diagram for describing an example of a process performed by the processing apparatus 10 in FIG. 6 of evaluating a polynomial expression obtained by approximating an arithmetic operation using an LUT.

Referring to FIG. 10, the polynomial expression converter 110 first determines to approximate an arithmetic operation f(x) by a second-order polynomial expression C₀+C₁X′+C₂X′². An n-bit variable X 1001 is input with respect to the arithmetic operation to be performed by the processing apparatus 10. The arithmetic operation may be any of the types of elementary functions described above. The addressing unit 120 determines an adaptive number of upper bits according to a variable section to which the n-bit variable X 1001 belongs. The obtainer 130 addresses an LUT 1010 using a value of the upper bits, thereby obtaining coefficients C₀, C₁, and C₂ of the second-order polynomial expression C₀+C₁X′+C₂X′² from the LUT 1010. Unlike the n-bit variable X 1001 of the arithmetic operation, a variable X′ to be input to the second-order polynomial expression C₀+C₁X′+C₂X′ is a value of m lower bits obtained by excluding the determined upper bits from the n-bit variable X 1001. The calculator 140 calculates a variable X′² by squaring the value of the m lower bits. Finally, the calculator 140 calculates a result value of the second-order polynomial expression C₀+C₁X′+C₂X′² using the coefficients C₀, C₁, and C₂ and the variables X′ and X′², thereby performing the arithmetic operation.

FIG. 11 is a diagram for describing examples of values to be input to a second-order polynomial expression obtained from a 10-bit variable X.

Referring to FIG. 11, it is assumed that the 10-bit variable X input to an arithmetic operation to evaluate an elementary function log₂(X) is “01001010xx”. The addressing unit 120 determines three upper bits “010” according to a variable section (for example, the variable section 901 of FIG. 9) to which the 10-bit variable X belongs. As described in FIG. 9, the three upper bits “010” correspond to an address Addr. i of an LUT. The obtainer 130 addresses the LUT using the address Addr. i′, thereby obtaining coefficients a_(k), b_(k), and c_(k) of a second-order polynomial expression 1100, i.e., C₀+C₁X′+C₂X′², from the LUT. Seven lower bits “01010xx” correspond to an input variable X′ of the second-order polynomial expression 1100. The calculator 140 calculates a variable X′² and then calculates a result value of the second-order polynomial expression 1100 using the coefficients a_(k), b_(k), and c_(k) and the variables X′ and X′², thereby performing the arithmetic operation of the elementary function log₂(X).

FIG. 12 illustrates another example of an LUT 1201.

Referring to FIG. 12, unlike the LUT 701 of FIG. 7, the LUT 1201 is for a third-order polynomial expression. Accordingly, four coefficients of the third-order polynomial expression are mapped to one address in the LUT 1201. As described above, the LUT 701 and the LUT 1201 are pre-stored in the memory device 20, and the processing apparatus 10 uses the LUT 701 or 1201 according to an order of the polynomial expression determined by the polynomial expression converter 110. Although a second or third-order polynomial expression is used in the examples described above, the examples are not limited thereto.

FIG. 13 is a diagram for describing another example of a process performed by the processing apparatus 10 in FIG. 6 of evaluating a polynomial expression obtained by approximating an arithmetic operation using an LUT.

Unlike FIG. 10 in which processes of evaluating a second-order polynomial expression are shown, FIG. 13 shows processes of evaluating a third-order polynomial expression C₀+C₁X′+C₂X′²+C₃X″. The processes of FIG. 13 are performed in a similar manner as the processes of FIG. 10, except that a third-order coefficient C₃ is additionally obtained from a LUT 1310 and the calculator 140 additionally calculates a variable X³.

FIG. 14 is a diagram for describing examples of methods 1410 and 1420 of determining a number of upper bits for setting addresses of an LUT.

Referring to FIG. 14, the method 1410 is performed when variables are split into variable sections having sizes that gradually decrease as variable values increase. Accordingly, when variable values increase, numbers of upper bits to be used as addresses of an LUT increase. The method 1420 is performed when variables are split into variables having sizes that gradually increase as variable values increase. Accordingly, when variable values increase, numbers of upper bits to be used as addresses of an LUT decrease. In other words, numbers of upper bits to be used as addresses of an LUT vary according to types of arithmetic operations, orders of polynomial expressions, accuracy of arithmetic operations, and precision of arithmetic operations.

FIG. 15 is a diagram for describing an example of a case in which addresses of an LUT are set using a fixed number of upper bits.

Referring to FIG. 15, using a fixed or uniform number of upper bits to set addresses of an LUT means that sizes of variable sections are the same. As described above, when sizes of variable sections are the same in an elementary function, regions in which errors between the elementary function and polynomial expressions are large and small co-exist, and thus it may be difficult to obtain an accurate result of an arithmetic operation.

FIG. 16 is a diagram for describing an example of a method 1610 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function log₂(x).

Referring to FIG. 16, variables in a graph 1600 of the elementary function log₂(x) are split into variable sections 1601 through 1603. In the graph 1600, a size of the variable section 1601 corresponding to a curve section is relatively small compared to a size of the variable section 1603 corresponding to a convergent section. In this example, the terms “curve section” and “convergent section” are used for convenience of description, but the example is not limited thereto.

In order to set addresses respectively corresponding to the variable sections 1601, five upper bits are used. In other words, the addresses respectively corresponding to the variable sections 1601 are set using upper bits “01000”, “01001”. “01010”, “01011”, “01100”, and “01101”. In other words, the addresses respectively corresponding to the variable sections 1601 are set using a larger number of upper bits than are used to set addresses respectively corresponding to the variable sections 1602 and 1603 because the sizes of the variable sections 1601 are smaller than the sizes of the variable sections 1602 and 1603. Since the sizes of the variable sections 1602 are smaller than the size of the variable section 1603, the addresses respectively corresponding to the variable sections 1602 are set using four upper bits. An address corresponding to the variable section 1603 having a largest size among the variable sections 1601 through 1603 is set using three upper bits.

The sizes of the variable sections 1601 through 1603 are non-uniform so that errors between the elementary function log₂(x) and polynomial expressions corresponding to the variable sections 1601 to 1603 are reduced, thereby increasing accuracy or precision of an arithmetic operation. Accordingly, by using non-uniform numbers of upper bits in setting addresses of an LUT to be addressed using an n-bit variable (for example, a 10-bit variable), the errors between the elementary function log₂(x) and the polynomial expressions corresponding to the variable sections 1601 to 1603 are reduced and the accuracy or precision of the arithmetic operation is increased.

In FIG. 16, the sizes of the variable sections 1601 through 1603 and the method 1610 are shown for convenience of description, but the example is not limited thereto.

FIG. 17 is a diagram for describing an example of a method 1710 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function 1/x.

Referring to FIG. 17, like in FIG. 16, variables in a graph 1700 of the elementary function 1/x are split into variable sections 1701 through 1703 having non-uniform sizes. Also, numbers of upper bits for setting addresses of an LUT are non-uniform based on the non-uniform sizes of the variable sections 1701 through 1703. In FIG. 17, the non-uniform sizes of the variable sections 1701 through 1703 and the method 1710 are shown for convenience of description, but the example is not limited thereto.

FIG. 18 is a diagram for describing an example of a method 1810 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function √{square root over (x)}.

Referring to FIG. 18, variables in a graph 1800 of the elementary function √{square root over (x)} are split into variable sections 1801 through 1803 having non-uniform sizes. Also, numbers of upper bits for setting addresses of an LUT are non-uniform based on the non-uniform sizes of the variable sections 1801 through 1803. In FIG. 18, the non-uniform sizes of the variable sections 1801 through 1803 and the method 1810 are shown for convenience of description, but the example is not limited thereto.

FIG. 19 is a diagram for describing an example of a method 1910 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function 1/√{square root over (x)}.

Referring to FIG. 19, variables in a graph 1900 of the elementary function 1/√{square root over (x)} are split into variable sections 1901 through 1903 having non-uniform sizes. Also, numbers of upper bits for setting addresses of an LUT are non-uniform based on the non-uniform sizes of the variable sections 1901 through 1903. In FIG. 19, the non-uniform sizes of the variable sections 1901 through 1903 and the method 1910 are shown for convenience of description, but the example is not limited thereto.

FIG. 20 is a diagram for describing an example of a method 2010 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function e^(x).

Referring to FIG. 20, variables in a graph 2000 of the elementary function e^(x) are split into variable sections 2001 through 2003 having non-uniform sizes. Also, numbers of upper bits for setting addresses of an LUT are also non-uniform based on the non-uniform sizes of the variable sections 2001 through 2003. In FIG. 20, the non-uniform sizes of the variable sections 2001 through 2003 and the method 2010 are shown for convenience of description, but the example is not limited thereto.

FIG. 21 is a diagram for describing an example of a method 2110 of determining numbers of upper bits for setting addresses of an LUT in a case of an elementary function sin(x).

Referring to FIG. 21, variables in a graph 2100 of the elementary function sin(x) are split into variable sections 2101 through 2103 having non-uniform sizes. Also, numbers of upper bits for setting addresses of an LUT are non-uniform based on the non-uniform sizes of the variable sections 2101 through 2103. In FIG. 21, the non-uniform sizes of the variable sections 2101 through 2103 and the method 2110 are shown for convenience of description, but the example is not limited thereto.

In FIGS. 16 through 21, variable sections corresponding to curve sections and convergent sections of specific elementary functions are set to have non-uniform sizes to non-uniformly determine numbers of upper bits for determining addresses of an LUT. However, it will be apparent to one of ordinary skill in the art that that this technique may also be applied to other types of elementary functions in addition to the elementary functions described above with reference to FIGS. 16 through 21.

The memory device 20 in FIG. 6 stores LUTs including addresses based on methods of determining numbers of upper bits described above (for example, the methods 1610 through 2110). Also, the addressing unit 120 in FIG. 6 determines upper bits for addressing the LUTs when a variable for an arithmetic operation is input based on such methods (for example, the methods 1610 through 2110).

FIG. 22 is a flowchart of an example of a method of performing an arithmetic operation performed by the processing apparatus 10 in FIG. 6. Referring to FIG. 22, the method includes operations described above that are performed sequentially by the processing apparatus 10. Thus, the details described above are also applicable to the method of FIG. 22 even if omitted below.

In operation 2201, the polynomial expression converter 110 determines a polynomial expression approximating an arithmetic operation to be performed on a variable.

In operation 2202, the addressing unit 120 adaptively determines upper bits for addressing an LUT (for example, the LUT 200 of FIG. 1) according to a variable section to which the variable belongs.

In operation 2203, the obtainer 130 obtains coefficients of the polynomial expression from the LUT by addressing the LUT using a value of the upper bits.

In operation 2204, the calculator 140 performs the arithmetic operation by calculating a result value of the polynomial expression using the coefficients.

As described above, by non-uniformly setting numbers of upper bits to be used to address an LUT, errors between an arithmetic operation and polynomial expressions approximating the arithmetic operation are reduced, and thus a processing apparatus is able to perform the arithmetic operation accurately and precisely.

The computing system 1, the central processing unit (CPU) 11, the graphics processing unit (GPU) 12, the memory device 20, and the LUT 200 illustrated in FIG. 1, the LUT 310 illustrated in FIG. 3B, the LUT illustrated in FIG. 4B, the processing apparatus 10, the polynomial expression converter 110, the addressing unit 120, the obtainer 130, the calculator 140, and the memory device 20 illustrated in FIG. 6, the addressing unit 120, the calculator 140, and the LUT 1010 illustrated in FIG. 10, and the addressing unit 120, the calculator 140, and the LUT 1310 illustrated in FIG. 13 that perform the operations described herein with respect to FIGS. 1-22 are implemented by hardware components. Examples of hardware components include controllers, sensors, generators, drivers, memories, comparators, arithmetic logic units, adders, subtractors, multipliers, dividers, integrators, and any other electronic components known to one of ordinary skill in the art. In one example, the hardware components are implemented by computing hardware, for example, by one or more processors or computers. A processor or computer is implemented by one or more processing elements, such as an array of logic gates, a controller and an arithmetic logic unit, a digital signal processor, a microcomputer, a programmable logic controller, a field-programmable gate array, a programmable logic array, a microprocessor, or any other device or combination of devices known to one of ordinary skill in the art that is capable of responding to and executing instructions in a defined manner to achieve a desired result. In one example, a processor or computer includes, or is connected to, one or more memories storing instructions or software that are executed by the processor or computer. Hardware components implemented by a processor or computer execute instructions or software, such as an operating system (OS) and one or more software applications that run on the OS, to perform the operations described herein with respect to FIGS. 1-22. The hardware components also access, manipulate, process, create, and store data in response to execution of the instructions or software. For simplicity, the singular term “processor” or “computer” may be used in the description of the examples described herein, but in other examples multiple processors or computers are used, or a processor or computer includes multiple processing elements, or multiple types of processing elements, or both. In one example, a hardware component includes multiple processors, and in another example, a hardware component includes a processor and a controller. A hardware component has any one or more of different processing configurations, examples of which include a single processor, independent processors, parallel processors, single-instruction single-data (SISD) multiprocessing, single-instruction multiple-data (SIMD) multiprocessing, multiple-instruction single-data (MISD) multiprocessing, and multiple-instruction multiple-data (MIMD) multiprocessing.

The method illustrated in FIG. 22 that performs the operations described herein with respect to FIGS. 1-22 are performed by computing hardware, for example, by one or more processors or computers, as described above executing instructions or software to perform the operations described herein.

Instructions or software to control a processor or computer to implement the hardware components and perform the methods as described above are written as computer programs, code segments, instructions or any combination thereof, for individually or collectively instructing or configuring the processor or computer to operate as a machine or special-purpose computer to perform the operations performed by the hardware components and the methods as described above. In one example, the instructions or software include machine code that is directly executed by the processor or computer, such as machine code produced by a compiler. In another example, the instructions or software include higher-level code that is executed by the processor or computer using an interpreter. Programmers of ordinary skill in the art can readily write the instructions or software based on the block diagrams and the flow charts illustrated in the drawings and the corresponding descriptions in the specification, which disclose algorithms for performing the operations performed by the hardware components and the methods as described above.

The instructions or software to control a processor or computer to implement the hardware components and perform the methods as described above, and any associated data, data files, and data structures, are recorded, stored, or fixed in or on one or more non-transitory computer-readable storage media. Examples of a non-transitory computer-readable storage medium include read-only memory (ROM), random-access memory (RAM), flash memory, CD-ROMs, CD-Rs, CD+Rs, CD-RWs, CD+RWs, DVD-ROMs, DVD-Rs, DVD+Rs, DVD-RWs, DVD+RWs, DVD-RAMs, BD-ROMs, BD-Rs, BD-R LTHs, BD-REs, magnetic tapes, floppy disks, magneto-optical data storage devices, optical data storage devices, hard disks, solid-state disks, and any device known to one of ordinary skill in the art that is capable of storing the instructions or software and any associated data, data files, and data structures in a non-transitory manner and providing the instructions or software and any associated data, data files, and data structures to a processor or computer so that the processor or computer can execute the instructions. In one example, the instructions or software and any associated data, data files, and data structures are distributed over network-coupled computer systems so that the instructions and software and any associated data, data files, and data structures are stored, accessed, and executed in a distributed fashion by the processor or computer.

While this disclosure includes specific examples, it will be apparent to one of ordinary skill in the art that various changes in form and details may be made in these examples without departing from the spirit and scope of the claims and their equivalents. The examples described herein are to be considered in a descriptive sense only, and not for purposes of limitation. Descriptions of features or aspects in each example are to be considered as being applicable to similar features or aspects in other examples. Suitable results may be achieved if the described techniques are performed in a different order, and/or if components in a described system, architecture, device, or circuit are combined in a different manner, and/or replaced or supplemented by other components or their equivalents. Therefore, the scope of the disclosure is defined not by the detailed description, but by the claims and their equivalents, and all variations within the scope of the claims and their equivalents are to be construed as being included in the disclosure. 

What is claimed is:
 1. An apparatus comprising: a memory configured to store a look-up table; and a processor including: a converter that determines a first polynomial expression that approximates an arithmetic operation to be performed on a first variable having n bits, and that determines a second polynomial expression that approximates the arithmetic operation to be performed on a second variable having n bits; an addressing circuit that sets a first address of the look-up table using m bits of the n bits of the first variable, and that sets a second address of the look-up table using k bits of the n bits of the second variable; an obtainer circuit that obtains first coefficients of the first polynomial expression from the look-up table using a value of the m bits, and that obtains second coefficients of the second polynomial expression from the look-up table using a value of the k bits; and a calculator that calculates a first result value of the first polynomial expression using the first coefficients, and that calculates a second result value of the second polynomial expression using the second coefficients, wherein each of n, m and k is a positive integer, m is less than n, k is less than n, and is less than m, and a difference between the first polynomial expression and the arithmetic operation is greater than a difference between the second polynomial expression and the arithmetic operation.
 2. The apparatus of claim 1, wherein the m bits are upper bits of the n bits of the first variable, and the k bits are upper bits of the n bits of the second variable.
 3. The apparatus of claim 2, wherein the addressing circuit adaptively determines the m bits for addressing the look-up table according to a first variable section of a plurality of variable sections, and determines the k bits for addressing the look-up table according to a second variable section of the plurality of variable sections, each of the plurality of variable sections is obtained by splitting a range of each variable that is input to the arithmetic operation, and sizes of the plurality of variable sections are non-uniform.
 4. The apparatus of claim 3, wherein when a size of a variable section increases, the number of the upper bits decreases, and when a size of the variable section decreases, the number of the upper bits increases.
 5. The apparatus of claim 1, wherein the arithmetic operation includes a square root operation, an inverse square root operation, a reciprocal operation, a log operation, an exponential operation, a power series operation, or a trigonometric operation.
 6. The apparatus of claim 1, wherein values of m and k are determined based on a type of the arithmetic operation.
 7. The apparatus of claim 1, wherein a first input variable of the first polynomial expression is a value of (n−m) bits of the first variable, and the calculator calculates the first result value of the first polynomial expression using the first input variable and the first coefficients.
 8. An apparatus comprising: a memory configured to store a look-up table; and a processor including: a converter that determines a first polynomial expression that approximates an arithmetic operation to be performed on a first variable having n bits, and that determines a second polynomial expression that approximates the arithmetic operation to be performed on a second variable having n bits; an addressing circuit that sets a first address of the look-up table using m bits of the n bits of the first variable, and that sets a second address of the look-up table using k bits of the n bits of the second variable; an obtainer circuit that obtains first coefficients of the first polynomial expression from the look-up table using the m bits, and that obtains second coefficients of the second polynomial expression from the look-up table using the k bits; and a calculator that calculates a first result value of the first polynomial expression using the first coefficients, and that calculates a second result value of the second polynomial expression using the second coefficients, wherein each of n, m and k is a positive integer, m is less than n, and k is less than n, and is different from m.
 9. The apparatus of claim 8, wherein a difference between the first polynomial expression and the arithmetic operation is greater than a difference between the second polynomial expression and the arithmetic operation, and m is greater than k.
 10. The apparatus of claim 8, wherein the m bits are upper bits of the n bits of the first variable, and the k bits are upper bits of the n bits of the second variable.
 11. The apparatus of claim 8, wherein the addressing circuit adaptively determines the m bits for addressing the look-up table according to a first variable section of a plurality of variable sections, and determines the k bits for addressing the look-up table according to a second variable section of the plurality of variable sections, each of the plurality of variable sections is obtained by splitting a range of each variable that is input to the arithmetic operation, and sizes of the plurality of variable sections are non-uniform.
 12. The apparatus of claim 11, wherein a degree of non-uniformity of the sizes of the plurality of variable sections varies based on a type of the arithmetic operation.
 13. The apparatus of claim 8, wherein values of m and k are determined based on a type of the arithmetic operation.
 14. The apparatus of claim 8, wherein a first input variable of the first polynomial expression is a value of (n−m) bits of the first variable, and the calculator calculates the first result value of the first polynomial expression using the first input variable and the first coefficients.
 15. The apparatus of claim 8, wherein each of the first result value and the second result value is a result of performing the arithmetic operation.
 16. A device comprising: a converter that determines a first polynomial expression that approximates an arithmetic operation to be performed on a first variable having n bits, and that determines a second polynomial expression that approximates the arithmetic operation to be performed on a second variable having n bits; an addressing circuit that sets a first address of a look-up table using m bits of the n bits of the first variable, and that sets a second address of the look-up table using k bits of the n bits of the second variable; an obtainer circuit that obtains first coefficients of the first polynomial expression from the look-up table using a value of the m bits, and that obtains second coefficients of the second polynomial expression from the look-up table using a value of the k bits; and a calculator that calculates a first result value of the first polynomial expression using the first coefficients, and that calculates a second result value of the second polynomial expression using the second coefficients, wherein each of n, m and k is a positive integer, m is less than n, k is less than n, and is less than m, and a first error between the first polynomial expression and the arithmetic operation is greater than a second error between the second polynomial expression and the arithmetic operation.
 17. The device of claim 16, wherein the look-up table is stored in an external memory device.
 18. The device of claim 16, further comprising a memory that stores the look-up table.
 19. The device of claim 16, wherein the addressing circuit adaptively determines the m bits according to a first variable section of a plurality of variable sections, and determines the k bits according to a second variable section of the plurality of variable sections, each of the plurality of variable sections is obtained by splitting a range of each variable that is input to the arithmetic operation, and sizes of the plurality of variable sections are non-uniform.
 20. The device of claim 18, wherein the m bits are upper bits of the n bits of the first variable, and the k bits are upper bits of the n bits of the second variable. 